308 research outputs found
MLPnP - A Real-Time Maximum Likelihood Solution to the Perspective-n-Point Problem
In this paper, a statistically optimal solution to the Perspective-n-Point
(PnP) problem is presented. Many solutions to the PnP problem are geometrically
optimal, but do not consider the uncertainties of the observations. In
addition, it would be desirable to have an internal estimation of the accuracy
of the estimated rotation and translation parameters of the camera pose. Thus,
we propose a novel maximum likelihood solution to the PnP problem, that
incorporates image observation uncertainties and remains real-time capable at
the same time. Further, the presented method is general, as is works with 3D
direction vectors instead of 2D image points and is thus able to cope with
arbitrary central camera models. This is achieved by projecting (and thus
reducing) the covariance matrices of the observations to the corresponding
vector tangent space.Comment: Submitted to the ISPRS congress (2016) in Prague. Oral Presentation.
Published in ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci., III-3,
131-13
Real-Time Multi-Fisheye Camera Self-Localization and Egomotion Estimation in Complex Indoor Environments
In this work a real-time capable multi-fisheye camera self-localization and egomotion estimation framework is developed. The thesis covers all aspects ranging from omnidirectional camera calibration to the development of a complete multi-fisheye camera SLAM system based on a generic multi-camera bundle adjustment method
Quantum computing implementations with neutral particles
We review quantum information processing with cold neutral particles, that
is, atoms or polar molecules. First, we analyze the best suited degrees of
freedom of these particles for storing quantum information, and then we discuss
both single- and two-qubit gate implementations. We focus our discussion mainly
on collisional quantum gates, which are best suited for atom-chip-like devices,
as well as on gate proposals conceived for optical lattices. Additionally, we
analyze schemes both for cold atoms confined in optical cavities and hybrid
approaches to entanglement generation, and we show how optimal control theory
might be a powerful tool to enhance the speed up of the gate operations as well
as to achieve high fidelities required for fault tolerant quantum computation.Comment: 19 pages, 12 figures; From the issue entitled "Special Issue on
Neutral Particles
Cost analysis of nondeterministic probabilistic programs
We consider the problem of expected cost analysis over nondeterministic probabilistic programs,
which aims at automated methods for analyzing the resource-usage of such programs.
Previous approaches for this problem could only handle nonnegative bounded costs.
However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,
both positive and negative costs are necessary and the costs are unbounded as well.
In this work, we present a sound and efficient approach to obtain polynomial bounds on the
expected accumulated cost of nondeterministic probabilistic programs.
Our approach can handle (a) general positive and negative costs with bounded updates in
variables; and (b) nonnegative costs with general updates to variables.
We show that several natural examples which could not be
handled by previous approaches are captured in our framework.
Moreover, our approach leads to an efficient polynomial-time algorithm, while no
previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime.
Finally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds
Cost Analysis of Nondeterministic Probabilistic Programs
We consider the problem of expected cost analysis over nondeterministic
probabilistic programs, which aims at automated methods for analyzing the
resource-usage of such programs. Previous approaches for this problem could
only handle nonnegative bounded costs. However, in many scenarios, such as
queuing networks or analysis of cryptocurrency protocols, both positive and
negative costs are necessary and the costs are unbounded as well.
In this work, we present a sound and efficient approach to obtain polynomial
bounds on the expected accumulated cost of nondeterministic probabilistic
programs. Our approach can handle (a) general positive and negative costs with
bounded updates in variables; and (b) nonnegative costs with general updates to
variables. We show that several natural examples which could not be handled by
previous approaches are captured in our framework.
Moreover, our approach leads to an efficient polynomial-time algorithm, while
no previous approach for cost analysis of probabilistic programs could
guarantee polynomial runtime. Finally, we show the effectiveness of our
approach by presenting experimental results on a variety of programs, motivated
by real-world applications, for which we efficiently synthesize tight
resource-usage bounds.Comment: A conference version will appear in the 40th ACM Conference on
Programming Language Design and Implementation (PLDI 2019
Microtubules as Platforms for Assaying Actin Polymerization In Vivo
The actin cytoskeleton is continuously remodeled through cycles of actin filament assembly and disassembly. Filaments are born through nucleation and shaped into supramolecular structures with various essential functions. These range from contractile and protrusive assemblies in muscle and non-muscle cells to actin filament comets propelling vesicles or pathogens through the cytosol. Although nucleation has been extensively studied using purified proteins in vitro, dissection of the process in cells is complicated by the abundance and molecular complexity of actin filament arrays. We here describe the ectopic nucleation of actin filaments on the surface of microtubules, free of endogenous actin and interfering membrane or lipid. All major mechanisms of actin filament nucleation were recapitulated, including filament assembly induced by Arp2/3 complex, formin and Spir. This novel approach allows systematic dissection of actin nucleation in the cytosol of live cells, its genetic re-engineering as well as screening for new modifiers of the process
- …